package lc2;

import org.junit.Test;

public class Ex718 {
    class Solution {
        public int findLength(int[] nums1, int[] nums2) {
            int m = nums1.length, n = nums2.length, res = 0;
            int[][] f = new int[m + 1][n + 1];
            //f[i][j] = 0, i = 0 || j = 0;
            for (int i = 1; i <= m; i++) {
                for (int j = 1; j <= n; j++) {
                    if (nums1[i - 1] == nums2[j - 1]) {
                        f[i][j] = f[i - 1][j - 1] + 1;
                    } else {
                        f[i][j] = 0;
                    }
                    res = Math.max(f[i][j], res);
                }
            }
            return res;
        }
    }

    @Test
    public void test() {
        char[] buf = {};
        int len = 0;
        while (len < buf.length && buf[len] != '\0') {
            len++;
        }
        // return len;
    }
}
